Reflection Factorizations of Singer Cycles
نویسنده
چکیده
The number of shortest factorizations into reflections for a Singer cycle in GLn(Fq) is shown to be (qn − 1)n−1. Formulas counting factorizations of any length, and counting those with reflections of fixed conjugacy classes are also given. The method is a standard character-theory technique, requiring the compilation of irreducible character values for Singer cycles, semisimple reflections, and transvections. The results suggest several open problems and questions, which are discussed at the end.
منابع مشابه
The number of 8-cycles in 2-factorizations of Kn
This paper gives a complete solution (with one possible exception) of the problem of constructing 2-factorizations of Kn containing a specified number of 8-cycles.
متن کاملOn the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups
In this paper we use orderly algorithms to enumerate (perfect) one-factorizations of complete graphs, the automorphism groups of which contain certain prescribed subgroups. We showed that, for the complete graph Ki2, excluding those one-factorizations containing exactly one automorphism of six disjoint cycles of length two, there are precisely 56391 nonisomorphic one-factorizations of Ki2 with ...
متن کاملA Refined Count of Coxeter Element Reflection Factorizations
For well-generated complex reflection groups, Chapuy and Stump gave a simple product for a generating function counting reflection factorizations of a Coxeter element by their length. This is refined here to record the number of reflections used from each orbit of hyperplanes. The proof is case-by-case via the classification of well-generated groups. It implies a new expression for the Coxeter ...
متن کاملFactoring Euclidean isometries
Every isometry of a finite dimensional euclidean space is a product of reflections and the minimum length of a reflection factorization defines a metric on its full isometry group. In this article we identify the structure of intervals in this metric space by constructing, for each isometry, an explicit combinatorial model encoding all of its minimal length reflection factorizations. The model ...
متن کاملPancomponented 2-factorizations of complete graphs
We pose and solve the existence of 2-factorizations of complete graphs and complete bipartite graphs that have the number of cycles per 2-factor varying, called pancomponented. Such 2-factorizations exist for all such graphs. The pancomponented problem requires a slight generalization of the methods used to solve pancyclic 2-factorization problem, by building 2-factors from cyclically generated...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013